منابع مشابه
Slead: Low-Memory, Steady Distributed Systems Slicing
Slicing a large-scale distributed system is the process of autonomously partitioning its nodes into k groups, named slices. Slicing is associated to an order on node-specific criteria, such as available storage, uptime, or bandwidth. Each slice corresponds to the nodes between two quantiles in a virtual ranking according to the criteria. For instance, a system can be split in three groups, one ...
متن کاملA parallel algorithm for dynamic slicing of distributed Java programs in non-DSM systems
We propose a parallel algorithm for dynamic slicing of distributed Java programs in non-Distributed Shared Memory (DSM) systems. Given a distributed Java program, we first construct an intermediate representation in the form of a Distributed Program Dependence Graph (DPDG). We mark and unmark the edges of the DPDG appropriately as and when dependencies arise and cease during run-time. Our algor...
متن کاملcoordination of protective schemes in distribution and subtransmission systems including distributed generation
نصب منابع پراکنده در سیستم های توزیع و فوق توزیع علاوه بر مزیت های فراوان، مشکلاتی را هم به همراه دارد. یکی از این مشکلات تأثیر این منابع روی اندازه جریان های اتصال کوتاه است. به طور معمول از حفاظت های مبتنی بر اصل جریان زیاد در سیستم های توزیع و فوق توزیع استفاده می شود. از مهمترین طرح های حفاظتی استفاده شده در فیدرهای توزیع، حفاظت فیوز- ریکلوزر است. همچنین از طرح های حفاظتی جریان زیاد جهتی در...
Distributed Order Dynamic Systems Distributed Order Dynamic Systems
distributed order dynamic systems distributed order distributed order dynamic systems stability simulation distributed order dynamic systems distributed order did you searching for distributed order dynamic systems free download distributed order dynamic systems book distributed order dynamic systems stability simulation dpords: dynamic partial order reduction in distributed data rate for distr...
متن کاملSlicing Distributed Programs
– Instead of defining both Ctl formulas and least fixed point computation algorithms, program slicing can be described as a μ-calculus formula [11] only. This greatly simplifies the definition of existing classes of program slicing (backward/forward/chopping, static/dynamic/hybrid/conditioned, syntaxpreserving/amorphous) in a unified and concise framework. Due to its capability of defining both...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2016
ISSN: 1045-9219
DOI: 10.1109/tpds.2015.2430856